An Efficient Simulation of Polynomial-Space Turing Machines by P Systems with Active Membranes
نویسندگان
چکیده
We show that a deterministic single-tape Turing machine, operating in polynomial space with respect to the input length, can be efficiently simulated (both in terms of time and space) by a semi-uniform family of P systems with active membranes and three polarizations, using only communication rules. Then, basing upon this simulation, we prove that a result similar to the space hierarchy theorem can be obtained for P systems with active membranes: the larger the amount of space we can use during the computations, the harder the problems we are able to solve.
منابع مشابه
The Computational Power of Exponential-Space P Systems with Active Membranes
We show that exponential-space P systems with active membranes characterize the complexity class EXPSPACE. This result is proved by simulating Turing machines working in exponential space via uniform families of P systems with restricted elementary active membranes; the simulation is efficient, in the sense that the time and space required are at most polynomial with respect to the resources em...
متن کاملOn a Powerful Class of Non-universal P Systems with Active Membranes
We prove that uniform and semi-uniform families of P systems with active membranes using only communication and nonelementary division rules are not computationally universal. However, they are powerful enough to solve exactly the problems solvable by Turing machines operating in time and space that are “tetrational” (i.e., bounded by a stack of exponentials of polynomial height) with respect t...
متن کاملNatural Computing Modelling of the Polynomial Space Turing Machines
In this paper we consider a bio-inspired description of the polynomial space Turing machines. For this purpose we use membrane computing, a formalism inspired by the way living cells are working. We define and use logarithmic space systems with active membranes, employing a binary representation in order to encode the positions on the Turing machine tape.
متن کاملP Systems with Active Membranes: Attacking NP-Complete Problems
P systems are parallel Molecular Computing models based on processing mul-tisets of objects in cell-like membrane structures. Various variants were already shown to be computationally universal, equal in power to Turing machines. In this paper one proposes a class of P systems whose membranes are the main active components, in the sense that they directly mediate the evolution and the communica...
متن کاملTuring Incompleteness of Asynchronous P Systems with Active Membranes
We prove that asynchronous P systems with active membranes without division rules can be simulated by place/transition Petri nets, and hence are computationally weaker than Turing machines. This result holds even if the synchronisation mechanisms provided by electrical charges and membrane dissolution are exploited.
متن کامل